home *** CD-ROM | disk | FTP | other *** search
- Path: fohnix.metronet.com!not-for-mail
- From: milam@fohnix.metronet.com (Stan Milam)
- Newsgroups: comp.lang.c
- Subject: Re: Sorting algorithm - In search of
- Date: 2 Mar 1996 19:37:52 -0600
- Organization: Texas Metronet, Inc (login info (214/488-2590 - 817/571-0400))
- Distribution: world
- Message-ID: <4hat5g$bdq@fohnix.metronet.com>
- References: <4h4jmq$3bh@news.cis.nctu.edu.tw> <4h6glr$ab6@utrhcs.cs.utwente.nl>
- NNTP-Posting-Host: fohnix.metronet.com
- X-Newsreader: TIN [version 1.2 PL2]
-
- Frans F.J. Faase (faase@cs.utwente.nl) wrote:
- : In article <4h4jmq$3bh@news.cis.nctu.edu.tw>, Don Pierce <don@pierce.geometrics.com> writes:
- : |> I am looking for an efficient sorting alogorithm
- : |> to sort an array of floats. I prefer a non-recursive
- : |> type because I heard they were inefficient on large data
- : |> sets. My array contains upt 10000 elements
-
- : You could try my Fast Bubble Sort:
- : http://wwwis.cs.utwente.nl:8080/~faase/Ha/bsort.c.txt
- : http://wwwis.cs.utwente.nl:8080/~faase/Ha/bsort_s.c.txt
- : Description on:
- : http://wwwis.cs.utwente.nl:8080/~faase/hacker.html
-
- : The bsort_s.c is the same as bosrt.c, except that it works for
- : simple types (like char, int, double) defined by STYPE.
- : (I did not test bsort_s.c)
-
- What in the world is wrong with the standard qsort() function. My experience
- with it is that it is very fast. Moreover, it is not restricted to a single
- data type.
-
- Regards,
- Stan Milam.
-